Residual Shuffle-Exchange Networks for Fast Processing of Long Sequences

Strict nonblockingness of reduced shuffle-exchange networks

The shuffle-exchange network is one of the most wellstudied multistage interconnection networks. Whether a (2n 1)-stage shuffle-exchange network is rearrangeable has been a challenging conjecture for some 30 years, and only recently a proof was claimed. In this article, we use the analysis method developed for EGSN networks to show that the shuffle-exchange network can be strictly nonblocking b...

On the Rearrangeability of Shuffle-Exchange Networks

Let be the minimum positive integer so that the Shuffle-Exchange network with stages, inputs and outputs is rearrangeable. Beneš conjectured that . The best bounds known so far are . In this paper, we verify Beneš conjecture for , and use this result to show that . The case is considerably more complex than the case, which have been done in the literature. We believe that hidden in our proof th...

Simulating Shuffle–Exchange Networks with P Systems

We present in this paper a simulation with P systems of the parallel architecture known as shuffle–exchange network. This will lead us to consider a new version of P systems with communication, for which the communication graphs are not fixed, but have a dynamic evolution, and for which different communication rules can be associated to different communication graphs. The simulation of the shuf...

Shuffle-Exchange Mesh Topology for Networks-on-Chip

Fault-Tolerance Properties of deBruijn and Shuffle-Exchange Networks

W e study node fault-tolerance propert ies of the dary deBruij’n and shufle-exchange networks by appealing t o the algebraic structure of their underlying digraphs. In particular, we prove that both of these families of digraphs have connectivity equal t o their minimum degree. T h i s result is new in the case of the shuffle-exchange digraphs and can be extended f o r both famil ies t o charac...